Disk Constrained 1-Center Queries
نویسنده
چکیده
We show that a set P of n points in the plane can be preprocessed in O(n log n)-time to construct a data structure supporting O(log n)-time queries of the following form: Find the minimum enclosing circle of P with center on a given disk.
منابع مشابه
Constrained Aggregate Similarity Queries in Metric Spaces
Abstract. The optimization of similarity queries using metric access methods has been widely discussed in the last decades. Similarity queries consider one object as the query center, and retrieve objects that are either far up to a radius or the nearest ones. Another important retrieval operation, less studied so far, is the Aggregate Similarity Query, which retrieves objects with the smallest...
متن کاملOptimal Path Queries in Very Large Spatial Databases
Researchers have been investigating the optimal route query problem for a long time. Optimal route queries are categorized as either unconstrained or constrained queries. Many main memory based algorithms have been developed to deal with the optimal route query problem. Among these, Dijkstra’s shortest path algorithm is one of the most popular algorithms for the unconstrained route query proble...
متن کاملEfficient caching for constrained skyline queries
Constrained skyline queries retrieve all points that optimize some user’s preferences subject to orthogonal range constraints, but at significant computational cost. This paper is the first to propose caching to improve constrained skyline query response time. Because arbitrary range constraints are unlikely to match a cached query exactly, our proposed method identifies and exploits similar ca...
متن کاملAn Experimental Evaluation of Smart Disk Architectures Using DSS Commercial Workloads
Smart disk systems with large storage capacities and growing computational power are becoming increasingly attractive. The idea is to perform parallel and filtering-type of data intensive computations on disks, close to data, thereby offloading the host processor and increasing the aggregate system power. In this paper, we evaluate in detail the performance of a host-based architecture and a sm...
متن کاملDesign and Evaluation of Distributed Smart Disk Architecture for I/O-Intensive Workloads
Smart disks, a type of processor-embedded active I/O devices, with their on-disk memory and network interface controller, can be viewed as processing elements with attached storage. The growing size and access patterns of today’s large I/O-intensive applications require architectures whose processing power scales with the storage capacity. We evaluate a distributed smart disk architecture with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012